On Attacks on Filtering Generators Using Linear Subspace Structures
نویسندگان
چکیده
The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines some bits from the shift register to create a key stream. A new attack on the filter generator has recently been described by Rønjom and Helleseth [6]. This paper gives an alternative and extended attack to reconstruct the initial state of the LFSR using the underlying subspace structure of the filter sequence. This improved attack provides further insight and more flexibility in performing the attack by Rønjom and Helleseth. The main improvements are that it does not use the coefficient sequences that were fundamental in the previous attack and works better in the unlikely cases when the original attack needed some modifications.
منابع مشابه
Attacks Against Filter Generators Exploiting Monomial Mappings
Filter generators are vulnerable to several attacks which have led to well-known design criteria on the Boolean filtering function. However, Rønjom and Cid have observed that a change of the primitive root defining the LFSR leads to several equivalent generators. They usually offer different security levels since they involve filtering functions of the form F (x) where k is coprime to (2 − 1) a...
متن کاملModified Alternating Step Generators with Non-Linear Scrambler
Pseudorandom generators, which produce keystreams for stream ciphers by the exclusiveor sum of outputs of alternately clocked linear feedback shift registers, are vulnerable to cryptanalysis. In order to increase their resistance to attacks, we introduce a non-linear scrambler at the output of these generators. Non-linear feedback shift register plays the role of the scrambler. In addition, we ...
متن کاملTotal break of Zorro using linear and differential attacks
An AES-like lightweight block cipher, namely Zorro, was proposed in CHES 2013. While it has a 16-byte state, it uses only 4 S-Boxes per round. This weak nonlinearity was widely criticized, insofar as it has been directly exploited in all the attacks on Zorro reported by now, including the weak key, reduced round, and even full round attacks. In this paper, using some properties discovered by Wa...
متن کاملTransform Domain Analysis of Sequences
In cryptanalysis, security of ciphers vis-a-vis attacks is gauged against three criteria of complexities, i.e., computations, memory and time. Some features may not be so apparent in a particular domain, and their analysis in a transformed domain often reveals interesting patterns. Moreover, the complexity criteria in different domains are different and performance improvements are often achiev...
متن کاملOpen Problems Related to Algebraic Attacks on Stream Ciphers
The recently developed algebraic attacks apply to all keystream generators whose internal state is updated by a linear transition function, including LFSR-based generators. Here, we describe this type of attacks and we present some open problems related to their complexity. We also investigate the design criteria which may guarantee a high resistance to algebraic attacks for keystream generator...
متن کامل